Sokoban: Enhancing general single-agent search methods using domain knowledge

نویسندگان

  • Andreas Junghanns
  • Jonathan Schaeffer
چکیده

Artificial intelligence (AI) research has developed an extensive collection of methods to solve state-space problems. Using the challenging domain of Sokoban, this paper studies the effect of general search enhancements on program performance. We show that the current state of the art in AI generally requires a large research and programming effort to use domain-dependent knowledge to solve even moderately complex problems in such difficult domains. The application of domainspecific knowledge to exploit properties of the search space can result in large reductions in the size of the search tree, often several orders of magnitude per search enhancement. This applicationspecific knowledge is discovered and applied using application-independent search enhancements. Understanding the effect of these enhancements on the search leads to a new taxonomy of search enhancements, and a new framework for developing single-agent search applications. This is used to illustrate the large gap between what is portrayed in the literature versus what is needed in practice.  2001 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain-Dependent Single-Agent Search Enhancements

Al research has developed an extensive collect ion of methods to solve state-space problems. Using the challenging domain of Sokoban, this paper studies the effect of search enhancements on program performance. We show that the current state of the ar t in AT generally requires a large p rog ramming and research effort into domain-dependent: methods to solve even moderately complex problems in ...

متن کامل

Single-Agent Search in the Presence of Deadlocks

Single-agent search is a powerful tool for solving a variety of applications. Most of the application domains used to explore single-agent search techniques have the property that if you start with a solvable state, at no time in the search can you reach a state that is unsolvable. In this paper we address the implications that arise when state transitions can lead to unsolvable (deadlock) stat...

متن کامل

Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban

We present a novel admissible pattern database heuristic (D) and tie-breaking rule (L) for Sokoban, allowing us to increase the number of optimally solved standard Sokoban instances from 20 to 28 and the number of proved optimal solutions from 25 to 32 compared to previous methods. The previously best heuristic for Sokoban (I) used the idea of an intermediate goal state to enable the effective ...

متن کامل

Solving Motion Planning Problems

This work considers a family of motion planning problems with movable blocks. Such problem is defined by a maze grid occupied by immovable blocks (walls) and free squares. There are k movable blocks (stones) and k fixed goal squares. The man is a movable block that can traverse free squares and move stones between them. The problem goal is to move the stones from their initial positions to the ...

متن کامل

Sokoban: Evaluating Standard Single-Agent Search Techniques in the Presence of Deadlock

Single-agent search is a powerful tool for solving a variety of applications. Most of the academic application domains used to explore single-agent search techniques have the property that if you start with a solvable state, at no time in the search can you reach a state that is unsolvable (it may, however, not be minimal). In this paper we address the implications that arise when states in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Artif. Intell.

دوره 129  شماره 

صفحات  -

تاریخ انتشار 2001